Search Results

Documents authored by Danos, Vincent

Document
DOI: 10.4230/OASIcs.Tokenomics.2022.4
Consistency of Automated Market Makers

Authors: Vincent Danos and Weijia Wang

Published in: OASIcs, Volume 110, 4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022)

Abstract
Decentralised Finance has popularised Automated Market Makers (AMMs), but surprisingly little research has been done on their consistency. Can a single attacker extract risk-free revenue from an AMM, regardless of price or other users' behaviour? In this paper, we investigate the consistency of a large class of AMMs, including the most widely used ones, and show that consistency holds.
Cite as

Vincent Danos and Weijia Wang. Consistency of Automated Market Makers. In 4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022). Open Access Series in Informatics (OASIcs), Volume 110, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{danos_et_al:OASIcs.Tokenomics.2022.4,
  author =	{Danos, Vincent and Wang, Weijia},
  title =	{{Consistency of Automated Market Makers}},
  booktitle =	{4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022)},
  pages =	{4:1--4:12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-274-7},
  ISSN =	{2190-6807},
  year =	{2023},
  volume =	{110},
  editor =	{Amoussou-Guenou, Yackolley and Kiayias, Aggelos and Verdier, Marianne},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2022.4},
  URN =		{urn:nbn:de:0030-drops-184217},
  doi =		{10.4230/OASIcs.Tokenomics.2022.4},
  annote =	{Keywords: Automated Market Makers, Decentralised Finance}
}
Document
Extended Abstract
DOI: 10.4230/OASIcs.Tokenomics.2022.7
Commit-Reveal Schemes Against Front-Running Attacks (Extended Abstract)

Authors: Andrea Canidio and Vincent Danos

Published in: OASIcs, Volume 110, 4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022)

Abstract
We provide a game-theoretic analysis of the problem of front-running attacks. We use it to study a simple commit-reveal protocol and discuss its properties. This protocol has costs because it requires two messages and imposes a delay. However, we show that it prevents the most severe front-running attacks ("bad MEV") while preserving legitimate competition between users, guaranteeing that the earliest transaction in a block belongs to the honest user who values it the most ("good MEV").
Cite as

Andrea Canidio and Vincent Danos. Commit-Reveal Schemes Against Front-Running Attacks (Extended Abstract). In 4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022). Open Access Series in Informatics (OASIcs), Volume 110, pp. 7:1-7:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{canidio_et_al:OASIcs.Tokenomics.2022.7,
  author =	{Canidio, Andrea and Danos, Vincent},
  title =	{{Commit-Reveal Schemes Against Front-Running Attacks}},
  booktitle =	{4th International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2022)},
  pages =	{7:1--7:5},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-274-7},
  ISSN =	{2190-6807},
  year =	{2023},
  volume =	{110},
  editor =	{Amoussou-Guenou, Yackolley and Kiayias, Aggelos and Verdier, Marianne},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2022.7},
  URN =		{urn:nbn:de:0030-drops-184241},
  doi =		{10.4230/OASIcs.Tokenomics.2022.7},
  annote =	{Keywords: Front running, Game theory, MEV, Transactions reordering, commit-reveal}
}
Document
Short Paper
DOI: 10.4230/OASIcs.Tokenomics.2020.10
Revisiting the Liquidity/Risk Trade-Off with Smart Contracts (Short Paper)

Authors: Vincent Danos, Jean Krivine, and Julien Prat

Published in: OASIcs, Volume 82, 2nd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2020)

Abstract
Real-time financial settlements constrain traders to have the cash on hand before they can enter a trade [Khapko and Zoican, 2017]. This prevents short-selling and ultimately impedes liquidity. We propose a novel trading protocol which relaxes the cash constraint, and manages chains of deferred payments. Traders can buy without paying first, and can re-sell while still withholding payments. Trades naturally arrange in chains which contract when deals are closed and extend when new ones open. Default risk is handled by reversing trades. In this short note we propose a class of novel financial instruments for zero-risk and zero-collateral intermediation. The central idea is that bilateral trades can be chained into trade lines. The ownership of an underlying asset becomes distributed among traders with positions in the trade line. The trading protocol determines who ends up owning that asset and the overall payoffs of the participants. Counterparty risk is avoided because the asset itself serves as a collateral for the entire chain of trades. The protocol can be readily implemented as a smart contract on a blockchain. Additional examples, proofs, protocol variants, and game-theoretic properties related to the order-sensitivity of the games defined by trade lines can be found in the extended version of this note [Danos et al., 2019]. Therein, one can also find the definition and game-theoretic analysis of standard trade-lines with applications to trust-less zero-collateral intermediation.
Cite as

Vincent Danos, Jean Krivine, and Julien Prat. Revisiting the Liquidity/Risk Trade-Off with Smart Contracts (Short Paper). In 2nd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2020). Open Access Series in Informatics (OASIcs), Volume 82, pp. 10:1-10:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{danos_et_al:OASIcs.Tokenomics.2020.10,
  author =	{Danos, Vincent and Krivine, Jean and Prat, Julien},
  title =	{{Revisiting the Liquidity/Risk Trade-Off with Smart Contracts}},
  booktitle =	{2nd International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2020)},
  pages =	{10:1--10:5},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-157-3},
  ISSN =	{2190-6807},
  year =	{2021},
  volume =	{82},
  editor =	{Anceaume, Emmanuelle and Bisi\`{e}re, Christophe and Bouvard, Matthieu and Bramas, Quentin and Casamatta, Catherine},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2020.10},
  URN =		{urn:nbn:de:0030-drops-135325},
  doi =		{10.4230/OASIcs.Tokenomics.2020.10},
  annote =	{Keywords: Electronic trading, Smart contracts, Static analysis}
}
Document
Complete Volume
DOI: 10.4230/OASIcs.Tokenomics.2019
OASIcs, Vol. 71, Tokenomics 2019, Complete Volume

Authors: Vincent Danos, Maurice Herlihy, Maria Potop-Butucaru, Julien Prat, and Sara Tucci-Piergiovanni

Published in: OASIcs, Volume 71, International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)

Abstract
OASIcs, Vol. 71, Tokenomics 2019, Complete Volume
Cite as

International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019). Open Access Series in Informatics (OASIcs), Volume 71, pp. 1-192, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@Proceedings{danos_et_al:OASIcs.Tokenomics.2019,
  title =	{{OASIcs, Vol. 71, Tokenomics 2019, Complete Volume}},
  booktitle =	{International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)},
  pages =	{1--192},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-108-5},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{71},
  editor =	{Danos, Vincent and Herlihy, Maurice and Potop-Butucaru, Maria and Prat, Julien and Tucci-Piergiovanni, Sara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2019},
  URN =		{urn:nbn:de:0030-drops-119634},
  doi =		{10.4230/OASIcs.Tokenomics.2019},
  annote =	{Keywords: OASIcs, Vol. 71, Tokenomics 2019, Complete Volume}
}
Document
Front Matter
DOI: 10.4230/OASIcs.Tokenomics.2019.0
Front Matter, Table of Contents, Preface, Conference Organization

Authors: Vincent Danos, Maurice Herlihy, Maria Potop-Butucaru, Julien Prat, and Sara Tucci-Piergiovanni

Published in: OASIcs, Volume 71, International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)

Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as

International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019). Open Access Series in Informatics (OASIcs), Volume 71, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{danos_et_al:OASIcs.Tokenomics.2019.0,
  author =	{Danos, Vincent and Herlihy, Maurice and Potop-Butucaru, Maria and Prat, Julien and Tucci-Piergiovanni, Sara},
  title =	{{Front Matter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{International Conference on Blockchain Economics, Security and Protocols (Tokenomics 2019)},
  pages =	{0:i--0:xii},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-108-5},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{71},
  editor =	{Danos, Vincent and Herlihy, Maurice and Potop-Butucaru, Maria and Prat, Julien and Tucci-Piergiovanni, Sara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.Tokenomics.2019.0},
  URN =		{urn:nbn:de:0030-drops-119640},
  doi =		{10.4230/OASIcs.Tokenomics.2019.0},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Invited Paper
DOI: 10.4230/LIPIcs.CONCUR.2016.1
Bayesian Inversion by Omega-Complete Cone Duality (Invited Paper)

Authors: Fredrik Dahlqvist, Vincent Danos, Ilias Garnier, and Ohad Kammar

Published in: LIPIcs, Volume 59, 27th International Conference on Concurrency Theory (CONCUR 2016)

Abstract
The process of inverting Markov kernels relates to the important subject of Bayesian modelling and learning. In fact, Bayesian update is exactly kernel inversion. In this paper, we investigate how and when Markov kernels (aka stochastic relations, or probabilistic mappings, or simply kernels) can be inverted. We address the question both directly on the category of measurable spaces, and indirectly by interpreting kernels as Markov operators: - For the direct option, we introduce a typed version of the category of Markov kernels and use the so-called "disintegration of measures". Here, one has to specialise to measurable spaces borne from a simple class of topological spaces -e.g. Polish spaces (other choices are possible). Our method and result greatly simplify a recent development in Ref. [4]. - For the operator option, we use a cone version of the category of Markov operators (kernels seen as predicate transformers). That is to say, our linear operators are not just continuous, but are required to satisfy the stronger condition of being $\om$-chain-continuous. Prior work shows that one obtains an adjunction in the form of a pair of contravariant and inverse functors between the categories of $L_1$- and $L_\infty$-cones [3]. Inversion, seen through the operator prism, is just adjunction. No topological assumption is needed. - We show that both categories (Markov kernels and $\om$-chain-continuous Markov operators) are related by a family of contravariant functors $T_p$ for $1\leq p\leq\infty$. The $T_p$'s are Kleisli extensions of (duals of) conditional expectation functors introduced in Ref. [3]. - With this bridge in place, we can prove that both notions of inversion agree when both defined: if $f$ is a kernel, and $f\dg$ its direct inverse, then $T_\infty(f)\dg=T_1(f\dg)$.
Cite as

Fredrik Dahlqvist, Vincent Danos, Ilias Garnier, and Ohad Kammar. Bayesian Inversion by Omega-Complete Cone Duality (Invited Paper). In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{dahlqvist_et_al:LIPIcs.CONCUR.2016.1,
  author =	{Dahlqvist, Fredrik and Danos, Vincent and Garnier, Ilias and Kammar, Ohad},
  title =	{{Bayesian Inversion by Omega-Complete Cone Duality}},
  booktitle =	{27th International Conference on Concurrency Theory (CONCUR 2016)},
  pages =	{1:1--1:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-017-0},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{59},
  editor =	{Desharnais, Jos\'{e}e and Jagadeesan, Radha},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.1},
  URN =		{urn:nbn:de:0030-drops-61909},
  doi =		{10.4230/LIPIcs.CONCUR.2016.1},
  annote =	{Keywords: probabilistic models, bayesian learning, markov operators}
}
Document
DOI: 10.4230/LIPIcs.CONCUR.2016.23
Robustly Parameterised Higher-Order Probabilistic Models

Authors: Fredrik Dahlqvist, Vincent Danos, and Ilias Garnier

Published in: LIPIcs, Volume 59, 27th International Conference on Concurrency Theory (CONCUR 2016)

Abstract
We present a method for constructing robustly parameterised families of higher-order probabilistic models. Parameter spaces and models are represented by certain classes of functors in the category of Polish spaces. Maps from parameter spaces to models (parameterisations) are continuous and natural transformations between such functors. Naturality ensures that parameterised models are invariant by change of granularity -- ie that parameterisations are intrinsic. Continuity ensures that models are robust with respect to their parameterisation. Our method allows one to build models from a set of basic functors among which the Giry probabilistic functor, spaces of cadlag trajectories (in continuous and discrete time), multisets and compact powersets. These functors can be combined by guarded composition, product and coproduct. Parameter spaces range over the polynomial closure of Giry-like functors. Thus we obtain a class of robust parameterised models which includes the Dirichlet process, various point processes (random sequences with values in Polish spaces) and other classical objects of probability theory. By extending techniques developed in prior work, we show how to reduce the questions of existence, uniqueness, naturality, and continuity of a parameterised model to combinatorial questions only involving finite spaces.
Cite as

Fredrik Dahlqvist, Vincent Danos, and Ilias Garnier. Robustly Parameterised Higher-Order Probabilistic Models. In 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 59, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{dahlqvist_et_al:LIPIcs.CONCUR.2016.23,
  author =	{Dahlqvist, Fredrik and Danos, Vincent and Garnier, Ilias},
  title =	{{Robustly Parameterised Higher-Order Probabilistic Models}},
  booktitle =	{27th International Conference on Concurrency Theory (CONCUR 2016)},
  pages =	{23:1--23:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-017-0},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{59},
  editor =	{Desharnais, Jos\'{e}e and Jagadeesan, Radha},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2016.23},
  URN =		{urn:nbn:de:0030-drops-61737},
  doi =		{10.4230/LIPIcs.CONCUR.2016.23},
  annote =	{Keywords: Probability, category theory, Giry monad}
}
Document
DOI: 10.4230/DagRep.5.9.125
Self-assembly and Self-organization in Computer Science and Biology (Dagstuhl Seminar 15402)

Authors: Vincent Danos and Heinz Koeppl

Published in: Dagstuhl Reports, Volume 5, Issue 9 (2016)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15402 "Self-assembly and Self-organization in Computer Science and Biology". With the trend of technological systems to become more distributed they tend to resemble closer biological systems. Biological systems on all scale are distributed and most often operate without central coordination. Taking the morphogenesis as an example, it is clear that the complexity and precision of distributed mechanisms in biology supersedes our current design attempts to distributed systems. The seminar assembled together researchers from computer science, engineering, physics and molecular biology working on the problem of decentralized coordination of distributed systems. Within every domain different terms have been coined, different analysis methods have been developed and applied and the seminar aims to foster the exchange of methods and the instantiation and alignment of important problem statements that can span across the disciplines. A representative example for a problem that is studied across domains through different methods is self-assembly. For example, computer scientists consider abstract self-assembly models such as Wang tiles to bound shape complexities while polymer physicists and biologists use molecular dynamics simulations to characterize self-assembly by means of energy and entropy. Because of its well-definedness, we deliberately placed emphasis on self-assembly that is otherwise entailed in the more general term self-organization. Within the domain of self-organization various research threads were represented at the seminar and a certain convergence of underlying concepts was possible. The seminar helped to exchange techniques from different domains and to agree on certain problem statements for future collaborations.
Cite as

Vincent Danos and Heinz Koeppl. Self-assembly and Self-organization in Computer Science and Biology (Dagstuhl Seminar 15402). In Dagstuhl Reports, Volume 5, Issue 9, pp. 125-138, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{danos_et_al:DagRep.5.9.125,
  author =	{Danos, Vincent and Koeppl, Heinz},
  title =	{{Self-assembly and Self-organization in Computer Science and Biology (Dagstuhl Seminar 15402)}},
  pages =	{125--138},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{9},
  editor =	{Danos, Vincent and Koeppl, Heinz},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.9.125},
  URN =		{urn:nbn:de:0030-drops-56887},
  doi =		{10.4230/DagRep.5.9.125},
  annote =	{Keywords: Self-assembly, molecular modeling, molecular dynamics, graph-rewriting grammars, self-organization, self-* systems, concurrency}
}
Document
DOI: 10.4230/LIPIcs.FSTTCS.2012.276
Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models

Authors: Vincent Danos, Jerome Feret, Walter Fontana, Russell Harmer, Jonathan Hayman, Jean Krivine, Chris Thompson-Walsh, and Glynn Winskel

Published in: LIPIcs, Volume 18, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)

Abstract
In this paper, we introduce a novel way of constructing concise causal histories (pathways) to represent how specified structures are formed during simulation of systems represented by rule-based models. This is founded on a new, clean, graph-based semantics introduced in the first part of this paper for Kappa, a rule-based modelling language that has emerged as a natural description of protein-protein interactions in molecular biology [Bachman 2011]. The semantics is capable of capturing the whole of Kappa, including subtle side-effects on deletion of structure, and its structured presentation provides the basis for the translation of techniques to other models. In particular, we give a notion of trajectory compression, which restricts a trace culminating in the production of a given structure to the actions necessary for the structure to occur. This is central to the reconstruction of biochemical pathways due to the failure of traditional techniques to provide adequately concise causal histories, and we expect it to be applicable in a range of other modelling situations.
Cite as

Vincent Danos, Jerome Feret, Walter Fontana, Russell Harmer, Jonathan Hayman, Jean Krivine, Chris Thompson-Walsh, and Glynn Winskel. Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 18, pp. 276-288, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{danos_et_al:LIPIcs.FSTTCS.2012.276,
  author =	{Danos, Vincent and Feret, Jerome and Fontana, Walter and Harmer, Russell and Hayman, Jonathan and Krivine, Jean and Thompson-Walsh, Chris and Winskel, Glynn},
  title =	{{Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)},
  pages =	{276--288},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-47-7},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{18},
  editor =	{D'Souza, Deepak and Radhakrishnan, Jaikumar and Telikepalli, Kavitha},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2012.276},
  URN =		{urn:nbn:de:0030-drops-38669},
  doi =		{10.4230/LIPIcs.FSTTCS.2012.276},
  annote =	{Keywords: concurrency, rule-based models, graph rewriting, pathways, causality}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact